Parallelizing Two Dimensional Convex Hull on NVIDIA GPU and Cell BE
نویسندگان
چکیده
Multicore processors are a shift of paradigm in computer architecture that promises dramatic increase in performance. But they also bring complexity in algorithmic design. In this paper we describe the challenges and design issues involved in parallelizing two dimensional convex hull on both CUDA and Cell Brodband Engine (Cell BE). We have parallelized the quickhull algorithm for two dimensional convex hull. The major advantage of this algorithm is that interprocessor communication cost is highly reduced.
منابع مشابه
GPU accelerated convex hull computation
We present a hybrid algorithm to compute the convex hull of points in three or higher dimensional spaces. Our formulation uses a GPU-based interior point filter to cull away many of the points that do not lie on the boundary. The convex hull of remaining points is computed on a CPU. The GPU-based filter proceeds in an incremental manner and computes a pseudo-hull that is contained inside the co...
متن کاملA 3D Convex Hull Algorithm for Graphics Hardware
This report presents a novel approach, termed gHull, to compute the convex hull for a given point set inR using the graphics processing units (GPUs). While the 2D problem can easily and efficiently be solved in the GPU, there is no known obvious, classical parallel solution that works well in the GPU for the 3D problem. Our novel parallel approach exploits the relationship between the 3D Vorono...
متن کاملA GPU Algorithm for Convex Hull
We present a novel algorithm to compute the convex hull of a point set in R using the graphics processing unit (GPU). By exploiting the relationship between the Voronoi diagram and the convex hull, we derive the answer from the former. Our algorithm only requires a few simple atomic operations and does not need explicit locking or any other concurrency control mechanism, thus it can maximize th...
متن کاملCollision detection of convex polyhedra on the NVIDIA GPU architecture for the discrete element method
Convex polyhedra represent granular media well. This geometric representation may be critical in obtaining realistic simulations of many industrial processes using the discrete element method (DEM). However detecting collisions between the polyhedra and surfaces that make up the environment and the polyhedra themselves is computationally expensive. This paper demonstrates the significant comput...
متن کاملA gHull: a GPU Algorithm for 3D Convex Hull
A novel algorithm is presented to compute the convex hull of a point set in R3 using the graphics processing unit (GPU). By exploiting the relationship between the Voronoi diagram and the convex hull, the algorithm derives the approximation of the convex hull from the former. The other extreme vertices of the convex hull are then found by using a two-round checking in the digital and the contin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009